Ela an Improved Characterisation of the Interior of the Completely Positive Cone
نویسنده
چکیده
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [M. Dür and G. Still, Interior points of the completely positive cone, Electronic Journal of Linear Algebra, 17:48–53, 2008]. In this paper, we introduce the concept of the set of zeros in the nonnegative orthant for a quadratic form, and use the properties of this set to give a more relaxed characterisation of the interior of the completely positive cone.
منابع مشابه
An improved characterisation of the interior of the completely positive cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [M. Dür and G. Still, Interior points of the completely positive cone, Electronic Journal of Linear Algebra, 17:48...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملA Short Note on the Interior of the Completely Positive Cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [7]. In this paper we introduce the concept of the set of zeros in the nonnegative orthant for a quadratic form an...
متن کاملEla 50
A matrix A is called completely positive if it can be decomposed as A = BBT with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone which plays a role in certain optimization problems. A characterization of the interior of this cone is provided.
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کامل